Accelerating eigenvector and pseudospectra computation using blocked multi-shift triangular solves

نویسندگان

  • Tim Moon
  • Jack Poulson
چکیده

Multi-shift triangular solves are basic linear algebra calculations with applications in eigenvector and pseudospectra computation. We propose blocked algorithms that efficiently exploit Level 3 BLAS to perform multishift triangular solves and safe multi-shift triangular solves. Numerical experiments indicate that computing triangular eigenvectors with a safe multi-shift triangular solve achieves speedups by a factor of 60 relative to LAPACK. This algorithm accelerates the calculation of general eigenvectors threefold. When using multi-shift triangular solves to compute pseudospectra, we report ninefold speedups relative to EigTool.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating computation of eigenvectors in the nonsymmetric eigenvalue problem

In the nonsymmetric eigenvalue problem, work has focused on the Hessenberg reduction and QR iteration, using efficient algorithms and fast, Level 3 BLAS routines. Comparatively, computation of eigenvectors performs poorly, limited to slow, Level 2 BLAS performance with little speedup on multi-core systems. It has thus become a dominant cost in the eigenvalue problem. To address this, we present...

متن کامل

Accelerating Computation of Eigenvectors in the Dense Nonsymmetric Eigenvalue Problem

In the dense nonsymmetric eigenvalue problem, work has focused on the Hessenberg reduction and QR iteration, using efficient algorithms and fast, Level 3 BLAS. Comparatively, computation of eigenvectors performs poorly, limited to slow, Level 2 BLAS performance with little speedup on multi-core systems. It has thus become a dominant cost in the solution of the eigenvalue problem. To address thi...

متن کامل

How Descriptive Are Gmres Convergence Bounds?

Eigenvalues with the eigenvector condition number, the eld of values, and pseu-dospectra have all been suggested as the basis for convergence bounds for minimum residual Krylov subspace methods applied to non-normal coeecient matrices. This paper analyzes and compares these bounds, illustrating with six examples the success and failure of each one. Reened bounds based on eigenvalues and the eld...

متن کامل

Computing the Field of Values and Pseudospectra Using the Lanczos Method with Continuation*

The field of values and pseudospectra are useful tools for understanding the behaviour of various matrix processes . To compute these subsets of the complex plane it is necessary to estimate one or two eigenvalues of a large number of parametrized Hermitian matrices; these computations are prohibitively expensive for large, possibly sparse, matrices, if done by use of the QR algorithm . We desc...

متن کامل

Properties and computations of matrix pseudospectra

Pseudospectra were introduced as early as 1975 and became popular tool during the 1990s.In this paper, we give a new definition of pseudospectra by using QR decomposition. Some properties of pseduospectra are explored and an algorithm for the computation of pseduospectra is given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1607.01477  شماره 

صفحات  -

تاریخ انتشار 2016